Horizontal visibility graphs from integer sequences
نویسندگان
چکیده
منابع مشابه
Integer sequences from walks in graphs
We define numbers of the type Oj(N) = N – N + N – ... + N and E(N) = –N + N – N + ... + N (j = 0, 1, 2, ...) and the corresponding integer sequences. We prove that these integer sequences, e.g., S0(N) = O0(N), O1(N), ..., Or(N), ... and SE(N) = E0(N), E1(N), ..., Er(N), ... correspond to the number of odd and even walks in complete graphs KN. We then prove that there is a unique family of graph...
متن کاملDetecting Series Periodicity with Horizontal Visibility Graphs
The horizontal visibility algorithm was recently introduced as a mapping between time series and networks. The challenge lies in characterizing the structure of time series (and the processes that generated those series) using the powerful tools of graph theory. Recent works have shown that the visibility graphs inherit several degrees of correlations from their associated series, and therefore...
متن کاملA characterization of horizontal visibility graphs and combinatorics on words
An Horizontal Visibility Graph (for short, HVG) is defined in association with an ordered set of non-negative reals. HVGs realize a methodology in the analysis of time series, their degree distribution being a good discriminator between randomness and chaos [B. Luque, et al., Phys. Rev. E 80 (2009), 046103]. We prove that a graph is an HVG if and only if outerplanar and has a Hamilton path. The...
متن کاملHorizontal visibility graphs: exact results for random time series.
The visibility algorithm has been recently introduced as a mapping between time series and complex networks. This procedure allows us to apply methods of complex network theory for characterizing time series. In this work we present the horizontal visibility algorithm, a geometrically simpler and analytically solvable version of our former algorithm, focusing on the mapping of random series (se...
متن کاملHorizontal visibility graphs generated by type-I intermittency.
The type-I intermittency route to (or out of) chaos is investigated within the horizontal visibility (HV) graph theory. For that purpose, we address the trajectories generated by unimodal maps close to an inverse tangent bifurcation and construct their associated HV graphs. We show how the alternation of laminar episodes and chaotic bursts imprints a fingerprint in the resulting graph structure...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics A: Mathematical and Theoretical
سال: 2016
ISSN: 1751-8113,1751-8121
DOI: 10.1088/1751-8113/49/35/35lt01